const github.com/klauspost/compress/zstd.dFastLongTableBits

20 uses

	github.com/klauspost/compress/zstd (current package)
		enc_dfast.go#L10: 	dFastLongTableBits = 17                      // Bits used in the long match table
		enc_dfast.go#L11: 	dFastLongTableSize = 1 << dFastLongTableBits // Size of the table
		enc_dfast.go#L15: 	dLongTableShardCnt  = 1 << (dFastLongTableBits - dictShardBits) // Number of shards in the table
		enc_dfast.go#L126: 			nextHashL := hashLen(cv, dFastLongTableBits, dFastLongLen)
		enc_dfast.go#L207: 				nextHashL = hashLen(cv, dFastLongTableBits, dFastLongLen)
		enc_dfast.go#L300: 		e.longTable[hashLen(cv0, dFastLongTableBits, dFastLongLen)] = te0
		enc_dfast.go#L301: 		e.longTable[hashLen(cv1, dFastLongTableBits, dFastLongLen)] = te1
		enc_dfast.go#L327: 			nextHashL := hashLen(cv, dFastLongTableBits, dFastLongLen)
		enc_dfast.go#L432: 			nextHashL := hashLen(cv, dFastLongTableBits, dFastLongLen)
		enc_dfast.go#L514: 				nextHashL = hashLen(cv, dFastLongTableBits, dFastLongLen)
		enc_dfast.go#L604: 		e.longTable[hashLen(cv0, dFastLongTableBits, dFastLongLen)] = te0
		enc_dfast.go#L605: 		e.longTable[hashLen(cv1, dFastLongTableBits, dFastLongLen)] = te1
		enc_dfast.go#L631: 			nextHashL := hashLen(cv, dFastLongTableBits, dFastLongLen)
		enc_dfast.go#L772: 			nextHashL := hashLen(cv, dFastLongTableBits, dFastLongLen)
		enc_dfast.go#L855: 				nextHashL = hashLen(cv, dFastLongTableBits, dFastLongLen)
		enc_dfast.go#L949: 		longHash1 := hashLen(cv0, dFastLongTableBits, dFastLongLen)
		enc_dfast.go#L950: 		longHash2 := hashLen(cv1, dFastLongTableBits, dFastLongLen)
		enc_dfast.go#L983: 			nextHashL := hashLen(cv, dFastLongTableBits, dFastLongLen)
		enc_dfast.go#L1058: 			e.dictLongTable[hashLen(cv, dFastLongTableBits, dFastLongLen)] = tableEntry{
		enc_dfast.go#L1065: 				e.dictLongTable[hashLen(cv, dFastLongTableBits, dFastLongLen)] = tableEntry{